The ( Euclidean) minimum weight triangulation ( MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design. 提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法,新的算法能够避免极值点重合的问题。
Convex hull computation is one of the fundamental problems in computational geometry, and is of wide application in many fields. 凸包计算是计算几何研究中的基本问题之一,在许多领域均有应用。
In computational geometry, computing cross products is at the heart of line-segment methods. 叉积是计算几何中关于线段算法的核心。
Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry. 简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用。
Researches on Computational Geometry Based on Privacy Protecting 一些基于私有信息保护的计算几何问题研究
A change to the Rectangle class for the graphical application may lead to a change, build, and test for the computational geometry application, and vice-versa. 图形应用中Rectangle类的变化可能导致计算几何应用变化,编译和测试,反之亦然;
By making use of the proximity query method in computational geometry, the whole matching query, pattern query, inverse query and outlier detection in time series are studied. 提出了计算几何应用到时间序列挖掘的方法,实现了时间序列全序列匹配查询、模式查询、反向查询和异常检测,查询效率和准确性都有了比较大的提高。
Conformal Geometric Algebra& A New Framework for Computational Geometry 共形几何代数&几何代数的新理论和计算框架
The obtained results can not only been applied to the design and implementation of algorithm for avoidance obstacle path planning, but also been used to solve the problems of computational geometry. 取得的结果不仅可直接应用于避障路径规划算法的设计与实现,而且还可应用于计算几何中相关问题的求解。
By analyzing the modeling of manufactured blade, applying the knowledge of infinitesimal geometry, computational geometry and numerical control technology, geometric synthesis method and correspondingly geometric theory are formulated to improve the blade making quality. 通过分析被加工叶片的造型规律,应用微分几何、计算几何与数控技术相结合,得到了提高叶片制造质量的几何综合法途径和相应的几何理论。
In this paper, the character of mathematics, aesthetics and mechanics of logarithmic helix, and the applications in computational geometry, industrial modeling, computer aided fluid surface optimum design had been studied. 本文对对数螺线的数学、美学和力学性质以及在计算几何、工业造型、计算机辅助流体曲面优化设计中的应用进行了研究。
Based on computational geometry and set theory, a vector algorithm for getting the Intersection set of two complex polygons is put forward in this paper. 基于计算几何和集合的基本理论,提出了任意两多边形求交的一种矢量算法。
Finally, some of the author's viewpoints on computational geometry on modern parallel computers are presented. 最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。
This paper first introduces the basic concepts of computational geometry and four basic problems, i. e. geometry searching. 本文首先介绍了计算几何的基本概念,论述了计算几何的四个基本问题,即几何搜索问题、相交问题、邻接问题及凸壳问题。
Basic Concept, Problems and Methods in Computational Geometry 计算几何的基本问题、概念和方法
Cartographic generalization is an open problem in computational geometry ( CG). 地图综合是计算几何中的一个应用的问题。
A computational geometry algorithm for assessing straightness is presented. 提出了一种用计算几何方法评定直线度误差的算法,并以实例加以验证,同时和以往算法进行了比较。
A method for seal imprint matching which based on triangulation of cupidity algorithm in computational geometry is proposed. 将计算几何中平面点集的三角剖分方法-贪心算法引入印鉴识别,研究了一种基于三角网格的印鉴匹配方法。
The interpolation of scattered data by multivariate splines is an important topic in computational geometry. 利用多元样条函数进行散乱数据插值是计算几何中一个非常重要的课题。
A new algorithm for two terminal net routing is presented, which is based on computational geometry. 提出了一种基于计算几何学的面向两端线网的布线算法。
Due to the applications of generalized convexity and set-valued analysis in image processing, computational geometry, error estimation and computer science, we are inspired to investigate generalized convexity from the angles of set-valued analysis. 广义凸性和集值分析在图像处理,计算几何,误差估计以及计算机科学等研究领域的广泛应用,启发着我们从集值分析角度开展广义凸性的研究。
The Voronoi diagram is a very important geometric structure and a very important research topic in computational geometry. Voronoi图是计算几何的一种仅次于凸包的重要几何结构,也是计算几何的重要研究内容之一。
Research the problem of secure multi-party computational geometry and Summary the development and results. 研究了安全多方计算中的几何计算问题,总结了其发展和研究成果;提出了一个解决安全多方判断三角不等式地协议,并将该协议应用于安全多方几何计算方面。
Range searching which is a very important problem in computational geometry, has widely application in practice. 范围查询问题是计算几何中的重要问题,有着广泛的应用背景。
ESP ( Euclidean shortest path) problem is a typical problem in Computational Geometry. Euclidean最短路径(ESP)问题是计算几何领域的经典问题。
Restrained triangulation plays an important role in the fields of finite element analysis, information visualization and etc. At the same time, it is also a hot problem in computational geometry and computer aided geometric design. 约束三角剖分在有限元分析和信息可视化等工程领域具有重要的应用背景,同时它也是计算几何和计算机辅助几何设计的一个热点问题。
We present a centralized area coverage-enhancing algorithm by using graph theroy and computational geometry. 基于图论和计算几何方法,提出一种集中式的区域覆盖增强算法。
Computational geometry is a study of computer algorithms to solve geometric problems. 计算几何是在计算机上研究解决几何问题的算法的学科,现已成为计算机科学的一个重要分支,也是解决其他计算机学科分支的重要理论基础。
The crossing number is an important measure of non-planarity of a graph, with applications in discrete and computational geometry, VLSI circuit design, and in several other areas of mathematics and theoretical computer science. 交叉数是图的非平面性的一个重要度量,已广泛应用于离散和计算几何、VLSI电路设计以及数学和理论计算机科学的其它领域。
Computational Geometry is an important embranchment of computer theoretical science. The subject has already made a tremendous development and produced a series of theoretical results. 计算几何是计算机理论科学的一个重要分支,该学科已经有了巨大的发展,产生了一系列的理论成果。